A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation
نویسندگان
چکیده
Given two sets of points on a line, we want to translate one of them so that their Hausdorr distance (the maximum of the distances from a point in any of the sets to the nearest point in the other set) is as small as possible. We present an optimal O(n logn) algorithm for this problem.
منابع مشابه
Hausdorff Distance under Translation for Points, Disks, and Balls
Let A and B be two sets of balls in Rd, d = 2, 3. We measure similarity between A and B by computing the minimum Hausdorff distance between A+ t and B, where the minimum is taken either over all vectors t ∈ Rd or over the vectors t such that A+t and B do not intersect. These problems arise in measuring similarity between the shapes of two proteins. We propose a number of exact and approximation...
متن کاملPartial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms
We consider the RMS distance (sum of squared distances between pairs of points) under translation between two point sets in the plane, in two different setups. In the partial-matching setup, each point in the smaller set is matched to a distinct point in the bigger set. Although the problem is not known to be polynomial, we establish several structural properties of the underlying subdivision o...
متن کاملMinimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
We consider the RMS-distance (sum of squared distances between pairs of points) under translation between two point sets in the plane. In the Hausdorff setup, each point is paired to its nearest neighbor in the other set. We develop algorithms for finding a local minimum in near-linear time in the line, and in nearly quadratic time in the plane. These improve substantially the worst-case behavi...
متن کاملLower Bounds for the Complexity of the Hausdorff Distance
We describe new lower bounds for the complexity of the directed Hausdorr distance under translation and rigid motion. We exhibit lower bound constructions of (n 3) for point sets under translation, for the L 1 , L 2 and L 1 norms, (n 4) for line segments under translation , for any L p norm, (n 5) for point sets under rigid motion and (n 6) for line segments under rigid motion, both for the L 2...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 106 شماره
صفحات -
تاریخ انتشار 1991